Minimal Undefinedness for Fuzzy Answer Sets

نویسندگان

  • Mario Alviano
  • Giovanni Amendola
  • Rafael Peñaloza
چکیده

Fuzzy Answer Set Programming (FASP) combines the nonmonotonic reasoning typical of Answer Set Programming with the capability of Fuzzy Logic to deal with imprecise information and paraconsistent reasoning. In the context of paraconsistent reasoning, the fundamental principle of minimal undefinedness states that truth degrees close to 0 and 1 should be preferred to those close to 0.5, to minimize the ambiguity of the scenario. The aim of this paper is to enforce such a principle in FASP through the minimization of a measure of undefinedness. Algorithms that minimize undefinedness of fuzzy answer sets are presented, and implemented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy autoepistemic logic and its relation to fuzzy answer set programming

Autoepistemic logic is an important formalism for nonmonotonic reasoning. It extends propositional logic by offering the ability to reason about an agent’s (lack of) beliefs. Moreover, it is well known to generalize the stable model semantics of answer set programming. Fuzzy logics on the other hand are multi-valued logics, which allow to model the intensity to which properties are satisfied. W...

متن کامل

Fuzzy Aggregates in Fuzzy Answer Set Programming

Fuzzy answer set programming [Saad, 2010; Saad, 2009; Subrahmanian, 1994] is a declarative framework for representing and reasoning about knowledge in fuzzy environments. However, the unavailability of fuzzy aggregates in disjunctive fuzzy logic programs, DFLP, with fuzzy answer set semantics [Saad, 2010] prohibits the natural and concise representation of many interesting problems. In this pap...

متن کامل

Uncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space

Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...

متن کامل

A View on Fuzzy Minimal Open Sets and Fuzzy Maximal Open Sets

A nonzero fuzzy open set () of a fuzzy topological space is said to be fuzzy minimal open (resp. fuzzy maximal open) set if any fuzzy open set which is contained (resp. contains) in is either or itself (resp. either or itself). In this note, a new class of sets called fuzzy minimal open sets and fuzzy maximal open sets in fuzzy topological spaces are introduced and studied which are subclasses ...

متن کامل

Computing Fuzzy Answer Sets Using dlvhex

Fuzzy answer set programming has been introduced as a framework that successfully combines the concepts of answer set programming and fuzzy logic. In this paper, we show how the fuzzy answer set semantics can be mapped onto the semantics for HEX-programs, which are nonmonotonic logic programs under the answer set semantics that support the use of external function calls. By using the DLVHEX rea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017